Dynamic stability of the set of Nash equilibria in stable stochastic games

نویسندگان

چکیده

Evolutionary dynamics model the changes in state of a population and strategies used by individuals population. One gets different based on types dependence fitness or revision protocols. In this paper we define Perturbed Best Response (PBR), Brown-von Neumann-Nash (BNN), Replicator Projection for stochastic games, using framework evolutionary games. We also class stable discuss their properties, relations with constituent games game. Further, prove that set distributions inducing Nash equilibria is globally asymptotically BNN dynamics, while same shown case strictly PBR unique rest point perturbed equilibrium to be stable. These dynamic stability results are illustrated examples.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Nash-Equilibria of Approximation-Stable Games

One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are far apart, or ǫ-equilibria that are far in variation distance from the true Nash equilibrium strategies, then this prediction may not be possible even in principle. Motivated by this consideration, in this paper we define the no...

متن کامل

Nash Equilibria in Perturbation-Stable Games

Motivated by the fact that in many game-theoretic settings, the game analyzed is only an approximation to the game being played, in this work we analyze equilibrium computation for the broad and natural class of bimatrix games that are stable under perturbations. We specifically focus on games with the property that small changes in the payoff matrices do not cause the Nash equilibria of the ga...

متن کامل

On Nash Equilibria in Stochastic Games

We study in nite stochastic games played by n-players on a nite graph with goals given by sets of in nite traces. The games are stochastic (each player simultaneously and independently chooses an action at each round, and the next state is determined by a probability distribution depending on the current state and the chosen actions), innite (the game continues for an in nite number of rounds),...

متن کامل

On Pure Nash Equilibria in Stochastic Games

Ummels andWojtczak initiated the study of findingNash equilibria in simple stochastic multi-player games satisfying specific bounds. They showed that deciding the existence of pure-strategy Nash equilibria (pureNE)where a fixed player wins almost surely is undecidable for games with 9 players. They also showed that the problem remains undecidable for the finite-strategy Nash equilibrium (finNE)...

متن کامل

Computing Nash Equilibria for Stochastic Games

We present two new algorithms for computing Nash equilibria of stochastic games. One is a global random start algorithm based on nonlinear programming, while the other combines a dynamical system with nonlinear programming to find stable equilibria. Promising numerical results are presented.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of dynamics and games

سال: 2023

ISSN: ['2164-6066', '2164-6074']

DOI: https://doi.org/10.3934/jdg.2023004